Stationary Random Graphs on Z with Pre- Scribed Iid Degrees and Finite Mean Con- Nections
نویسندگان
چکیده
Let F be a probability distribution with support on the non-negative integers. A model is proposed for generating stationary simple graphs on Z with degree distribution F and it is shown for this model that the expected total length of all edges at a given vertex is finite if F has finite second moment. It is not hard to see that any stationary model for generating simple graphs on Z will give infinite mean for the total edge length per vertex if F does not have finite second moment. Hence, finite second moment of F is a necessary and sufficient condition for the existence of a model with finite mean total edge length.
منابع مشابه
Stationary Random Graphs with Prescribed Iid Degrees on a Spatial Poisson Process
Let [P ] be the points of a Poisson process on R and F a probability distribution with support on the non-negative integers. Models are formulated for generating translation invariant random graphs with vertex set [P ] and iid vertex degrees with distribution F , and the length of the edges is analyzed. The main result is that finite mean for the total edge length per vertex is possible if and ...
متن کاملInvariant random graphs with iid degrees in a general geography
Let D be a non-negative integer-valued random variable and let G = (V, E) be an infinite transitive finite-degree graph. Continuing the work of Deijfen and Meester [5] and Deijfen and Jonasson [4], we seek an Aut(G)-invariant random graph model with V as vertex set, iid degrees distributed as D and finite mean connections (i.e. the sum of the edge lengths in the graph metric of G of a given ver...
متن کاملGenerating stationary random graphs on Z with prescribed i.i.d. degrees
Let F be a probability distribution with support on the non-negative integers. Two algorithms are described for generating a stationary random graph, with vertex set Z, so that the degrees of the vertices are i.i.d. random variables with distribution F . Focus is on an algorithm where, initially, a random number of “stubs” with distribution F is attached to each vertex. Each stub is then random...
متن کاملExtreme value theory for moving average processes with light-tailed innovations
We consider stationary infinite moving average processes of the form Yn = ∞ ∑ i=−∞ ciZn+i, n ∈ Z, where (Zi)i∈Z is a sequence of iid random variables with “light tails” and (ci)i∈Z is a sequence of positive and summable coefficients. By light tails we mean that Z0 has a bounded density f(t) ∼ ν(t) exp(−ψ(t)), where ν(t) behaves roughly like a constant as t→∞ and ψ is strictly convex satisfying ...
متن کاملDegrees of Freedom in Non-Coherent Stationary MIMO Fading Channels
New non-asymptotic upper bounds on the capacity of non-coherent multiple-input multiple-output (MIMO) Gaussian fading channels with memory are proposed. These bounds are used to derive upper bounds on the fading number of regular Gaussian fading channels and on the pre-log of non-regular ones. The resulting bounds are tight in the multiple-input single-output (MISO) spatially IID Gaussian case ...
متن کامل